Hash-based Multivariate Public Key Cryptosystems

نویسندگان

  • Hou-Zhen Wang
  • Huan-Guo Zhang
چکیده

Many efficient attacks have appeared in recent years, which have led to serious blow for the traditional multivariate public key cryptosystems. For example, the signature scheme SFLASH was broken by Dubois et al. at CRYPTO’07, and the Square signature (or encryption) scheme by Billet et al. at ASIACRYPTO’09. Most multivariate schemes known so far are insecure, except maybe the sigature schemes UOV and HFEv-. Following these new developments, it seems that the general design principle of multivariate schemes has been seriously questioned, and there is a rather pressing desire to find new trapdoor construction or mathematical tools and ideal. In this paper, we introduce the hash authentication techniques and combine with the traditional MQ-trapdoors to propose a novel hash-based multivariate public key cryptosystems. The resulting scheme, called EMC (Extended Multivariate Cryptosystem), can also be seen as a novel hash-based cryptosystems like Merkle tree signature. And it offers the double security protection for signing or encrypting. By the our analysis, we can construct the secure and efficient not only signature scheme but also encryption scheme by using the EMC scheme combined some modification methods summarized by Wolf. And thus we present two new schems: EMC signature scheme (with the Minus method “-”) and EMC encryption scheme (with the Plus method “+”). In addition, we also propose a reduced scheme of the EMC signature scheme (a light-weight signature scheme). Precise complexity estimates for these schemes are provided, but their security proofs in the random oracle model are still an open problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

QTRU: quaternionic version of the NTRU public-key cryptosystems

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...

متن کامل

Multivariate Public Key Cryptosystems

As the title says, this book is about Multivariate cryptography. Besides code-, latticeand hash-based cryptosystems, Multivariate cryptography is one of the main fields of cryptosystems which are believed to be secure against attacks with quantum computers. Multivariate cryptography deals with systems of nonlinear polynomial equations in several variables over a finite field which are difficult...

متن کامل

Immunizing Public Key Cryptosystems against Chosen Ciphertext Attacks 1

This paper presents three methods for strengthening public key cryptosys-tems in such a way that they become secure against adaptively chosen ciphertext attacks. In an adaptively chosen ciphertext attack, an attacker can query the deciphering algorithm with any ciphertexts, except for the exact object cipher-text to be cryptanalyzed. The rst strengthening method is based on the use of one-way h...

متن کامل

A Construction of Public-Key Cryptosystem Based on Singular Simultaneous Equations

Extensive studies have been made of the public key cryptosystems based on multivariate polynomials over F2. However most of the proposed public key cryptosystems based on multivariate polynomials, are proved not secure. In this paper, we propose several types of new constructions of public key cryptosystems based on randomly generated singular simultaneous equations. One of the features of the ...

متن کامل

Immunizing Public Key Cryptosystems Against Chosen Ciphertext Attacks

This paper presents three methods for strengthening public key cryptosys tems in such a way that they become secure against adaptively chosen ciphertext attacks In an adaptively chosen ciphertext attack an attacker can query the deciphering algorithm with any ciphertexts except for the exact object cipher text to be cryptanalyzed The rst strengthening method is based on the use of one way hash ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2010  شماره 

صفحات  -

تاریخ انتشار 2010